Attacker Deterrence and Perceived Risk in a Stackelberg Security Game

ثبت نشده
چکیده

In Stackelberg security games, a defender must allocate scarce resources to defend against a potential attacker. The optimal defense involves the randomization of scarce security resources, yet how attackers perceive the risk given randomized defense is not well understood. We conducted an experiment where attackers chose whether to attack or not attack targets protected by randomized defense schemes, the key treatment variable being whether the defender picks one target at random to guard or imperfectly guards all targets. The two schemes are expected payoff equivalent, and when provided separately we found no effect of having one scheme or the other. Yet, when both are present, we found that subjects had a preference for the fixed scheme, a preference which cannot be reduced to differences in beliefs. Overall, our results suggest that understanding how individuals perceive risk is vital to understand the behavior of attackers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attacker Deterrence and Perceived Risk in a Stackelberg Security Game.

In Stackelberg security games, a defender must allocate scarce resources to defend against a potential attacker. The optimal defense involves the randomization of scarce security resources, yet how attackers perceive the risk given randomized defense is not well understood. We conducted an experiment where attackers chose whether to attack or not attack targets protected by randomized defense s...

متن کامل

Adversarial Patrolling Games

Defender-Attacker Stackelberg games are the foundations of tools deployed for computing optimal patrolling strategies in adversarial domains such as the United states Federal Air Marshals Service and the United States Coast Guard, among others. In Stackelberg game models of these systems the attacker knows only the probability that each target is covered by the defender, but is oblivious to the...

متن کامل

Learning to Play Stackelberg Security Games

As discussed in previous chapters, algorithmic research on Stackelberg Security Games has had a striking real-world impact. But an algorithm that computes an optimal strategy for the defender can only be as good as the game it receives as input, and if that game is an inaccurate model of reality then the output of the algorithm will likewise be flawed. Consequently, researchers have introduced ...

متن کامل

Security Games with Multiple Attacker Resources

Algorithms for finding game-theoretic solutions are now used in several real-world security applications. This work has generally assumed a Stackelberg model where the defender commits to a mixed strategy first. In general two-player normal-form games, Stackelberg strategies are easier to compute than Nash equilibria, though it has recently been shown that in many security games, Stackelberg st...

متن کامل

Solving Stackelberg Security Games For Multiple Defenders and Multiple Attackers

In the last years, there has been a substantial effort in the application of Stackelberg game-theoretic approaches in the security arena, in which security agencies implement patrols and checkpoints to protect targets from criminal attacks. The classical game-theoretic approach employed successful to solve security games is that of a Stackelberg game between a defender (leader) and an attacker ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015